A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
نویسندگان
چکیده
A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a dispute, the identity of a signature’s originator can be revealed (only) by a designated entity. The interactive counterparts of group signatures are identity escrow schemes or group identification scheme with revocable anonymity. This work introduces a new provably secure group signature and a companion identity escrow scheme that are significantly more efficient than the state of the art. In its interactive, identity escrow form, our scheme is proven secure and coalition-resistant under the strong RSA and the decisional Diffie-Hellman assumptions. The security of the noninteractive variant, i.e., the group signature scheme, relies additionally on the Fiat-Shamir heuristic (also known as the random oracle model).
منابع مشابه
A New Digital Signature Scheme and its Application to aPractical
This paper introduces a new digital signature scheme that is provably secure against adaptive chosen message attacks provided the so-called Strong RSA Assumption holds. This signature scheme leads to a new coalition-resistant group signature scheme that is signiicantly more eecient than the previously known schemes with the same security properties .
متن کاملXMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family. Its signature size is reduced to less than 25% compared to the best provably secure hash based signature scheme.
متن کاملA Practical Coalition-resistant Group Blind Signature Scheme
A group signature allow any member of a group to sign on behalf of the group. A group blind signature requires that a group member signs on group’s behalf a document without knowing its content. In this paper we propose a practical coalition-resistant group blind signature scheme based on the strong RSA and the decisional Diffie-Hellman assumptions. Our scheme is an extension of the group signa...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملProvably Secure and Practical Identification Schemes and Corresponding Signature Schemes
This paper presents a three-move interactive identification scheme and proves it to be as secure as t h e discrete logarithm problem. This provably secure scheme is almost as efficient as t,he Schnorr identification scheme, while the Schnorr scheme is not provably secure. This paper also presents another practical identification scheme which is proven to be as secure as the factoring problem ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000